Fibonacci, tribonacci, …, hexanacci and parallel “error-free” machine arithmetic

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determinantal Representations for Generalized Fibonacci and Tribonacci Numbers

the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Using certain Hessenberg matrices, we provide some determinantal representations of the general terms of second-and third-order linear recurrence sequences with arbitrary initial values. Moreover, we provide explicit formu...

متن کامل

Tribonacci Numbers with Indices in Arithmetic Progression and Their Sums

In this paper, we give a recurrence relation for the Tribonacci numbers with indices in aritmetics progression, fTrnCsg for 0 s < n. We find sums of fTrng for arbitrary integer r via matrix methods. 2000 Mathematics Subject Classification: 11B39; 11C20

متن کامل

Error-free transformations in real and complex floating point arithmetic

Error-free transformation is a concept that makes it possible to compute accurate results within a floating point arithmetic. Up to now, it has only be studied for real floating point arithmetic. In this short note, we recall the known error-free transformations for real arithmetic and we propose some new error-free transformations for complex floating point arithmetic. This will make it possib...

متن کامل

On k-Fibonacci numbers of arithmetic indexes

In this paper, we study the sums of k-Fibonacci numbers with indexes in an arithmetic sequence, say anþ r for fixed integers a and r. This enables us to give in a straightforward way several formulas for the sums of such numbers. 2008 Elsevier Inc. All rights reserved.

متن کامل

Accurate Floating Point Arithmetic through Hardware Error-Free Transformations

This paper presents a hardware approach to performing accurate floating point addition and multiplication using the idea of errorfree transformations. Specialized iterative algorithms are implemented for computing arbitrarily accurate sums and dot products. The results of a Xilinx Virtex 6 implementation are given, area and performance are compared against standard floating point units and it i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Optics

سال: 2019

ISSN: 2412-6179,0134-2452

DOI: 10.18287/2412-6179-2019-43-6-1072-1078